Searching in Compressed Image Databases
نویسنده
چکیده
Content-based image retrieval consists in retrieving from an image database the most similar image with respect to a query, according to some similarity measure. This scenario has numerous specific applications that include bioinformatics and medical imaging, among others. However, because the size of image repositories grows very fast, finding patterns in images requires an index to avoid a sequential scan, thus reducing the search time. Considering that small (and high) levels are faster than larger ones in the memory hierarchy, it would be very beneficial to have a compressed representation of the image database that can give fast access and pattern matching functionalities in high memory levels. In this thesis we propose a deep study of searching in compressed image databases, contributing with new algorithms for approximate indexed search based on template matching. Our specific objectives are to determine the feasibility of extending existing approaches for indexed exact template matching to approximate template matching working on compressed image databases, in particular allowing don’t care pixels; to design a similarity measure based on information theory to be used for approximate template matching; and to evaluate the impact on the performance and quality of results, in feature vector based similarity search, when the index is compressed in lossy form.
منابع مشابه
Application of Fractal Codes as Similarity Measure for Compressed Image Databases
In image database applications, it is desirable that functions such as searching, browsing, and partial recall be done without totally decompressing the images. Using wavelet-compressed images is becoming increasingly popular. Image databases, and edge images derived from such compressed images can be viewed as indexes that can be queried by examples. In this research, a fractional code generat...
متن کاملCompressed Pattern Matching for Predictive Lossless Image Encoding
Pattern matching in compressed image domain is a new topic in computer science. Many works have been reported for pattern matching for compressed text and for lossy compressed image. However, searching of images in lossless compressed domain is almost a blank area and needs to be explored. Lossless image compression is widely used in areas such as medical images, satellite images, geometric ima...
متن کاملImplementation of Clustering-Based Image Retrieval System
Digital images are useful media for storing spatial, spectral and temporal components of information. Large image databases often store the images in compressed format, JPEG for example. This paper examines the algorithms of direct extraction of low level features from compressed images, working with three different clustering techniques. Results indicate that a K-Harmonic means clustering algo...
متن کاملSemantic-Based Image Retrial in the VQ Compressed Domain using Image Annotation Statistical Models
متن کامل
A Miniature-Based Image Retrieval System
Md. Saiful Islam and Md. Haider Ali Institute of Information Technology, Dept. of Computer Science and Engineering, University of Dhaka , Dhaka-1000, Bangladesh E-mail: [email protected], [email protected] Abstract Due to the rapid development of World Wide Web (WWW) and imaging technology, more and more images are available in the Internet and stored in databases. Searching the related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009